Message Passing Optimization of Harmonic Influence Centrality
نویسندگان
چکیده
منابع مشابه
Stochastic optimization by message passing
Most optimization problems in applied sciences realistically involve uncertainty in the parameters defining the cost function, of which only statistical information is known beforehand. Here we provide an in-depth discussion of how message passing algorithms for stochastic optimization based on the cavity method of statistical physics can be constructed. We focus on two basic problems, namely t...
متن کاملMessage Passing and Combinatorial Optimization
Graphical models use the intuitive and well-studied methods of graph theory to implicitly represent dependencies between variables in large systems. They can model the global behaviour of a complex system by specifying only local factors.This thesis studies inference in discrete graphical models from an “algebraic perspective” and the ways inference can be used to express and approximate NP-har...
متن کاملOptimization of Message Passing Libraries – Two Examples
The computation of large problems in scientifical and industrial fields needs for efficient computer systems. A rising number parallel computers are used to deliver necessary computation resources. The physical restrictions of circuit integration limit the speed of single processor solutions. The use of consumer components is a cost–effective way to built a parallel computer. The deployment of ...
متن کاملThe harmonic influence in social networks and its distributed computation by message passing
In this paper we elaborate upon a measure of node influence in social networks, which was recently proposed by Vassio et al., IEEE Trans. Control Netw. Syst., 2014. This measure quantifies the ability of the node to sway the average opinion of the network. Following the approach by Vassio et al., we describe and study a distributed message passing algorithm that aims to compute the nodes’ influ...
متن کاملConvergence of Min-Sum Message Passing for Quadratic Optimization
We establish the convergence of the min-sum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2014
ISSN: 2325-5870
DOI: 10.1109/tcns.2014.2304870